The word problem for free adequate semigroups
نویسندگان
چکیده
We study the complexity of computation in finitely generated free left, right and two-sided adequate semigroups and monoids. We present polynomial time (quadratic in the RAM model of computation) algorithms to solve the word problem and compute normal forms in each of these, and hence also to test whether any given identity holds in the classes of left, right and/or two-sided adequate semigroups.
منابع مشابه
Some properties of a class of polyhedral semigroups based upon the subword reversing method
In this paper a certain class of polyhedral semigroups which has a presentation $$ is examined. The completeness of the presentation and solvability of word problem of this class of semigroups is determined. Moreover the combinatorial distance between two words is determined.
متن کاملOn the decidability of the word problem for amalgamated free products of inverse semigroups
We study inverse semigroup amalgams [S1, S2;U ], where S1 and S2 are finitely presented inverse semigroups with decidable word problem and U is an inverse semigroup with decidable membership problem in S1 and S2. We use a modified version of Bennett’s work on the structure of Schützenberger graphs of the R-classes of S1 ∗U S2 to state sufficient conditions for the amalgamated free products S1 ∗...
متن کاملOn Free Products of Completely Regular Semigroups
The free product CR S i of an arbitrary family of disjoint completely simple semigroups fS i g i2I , within the variety CR of completely regular semigroups, is described by means of a theorem generalizing that of Ka dourek and Poll ak for free completely regular semigroups. A notable consequence of the description is that all maximal subgroups of CR S i are free, except for those in the factors...
متن کاملFree Idempotent Generated Semigroups over Bands
We study the general structure of the free idempotent generated semigroup IG(B) over an arbitrary band B. We show that IG(B) is always a weakly abundant semigroup with the congruence condition, but not necessarily abundant. We then prove that if B is a normal band or a quasi-zero band for which IG(B) satisfies Condition (P ), then IG(B) is an abundant semigroup. In consequence, if Y is a semila...
متن کاملDecision and Separability Problems for Baumslag-Solitar Semigroups
We show that the semigroups Sk,` having semigroup presentations 〈a, b : abk = b`a〉 are residually finite and finitely separable. Generally, these semigroups have finite separating images which are finite groups and other finite separating images which are semigroups of order-increasing transformations on a finite partially ordered set. These semigroups thus have vastly different residual and se...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- IJAC
دوره 24 شماره
صفحات -
تاریخ انتشار 2014